Analytical Model for Evaluating Blocking in Gsm Networks with Directed Retry
نویسندگان
چکیده
We present an analytical model and propose an efficient algorithm for evaluating call blocking in GSM networks with directed retry, where a call blocked by the sector of its initial attempt may be redirected to one or more alternative sectors. Since exact solution by Markov-chain analysis is unfeasible in large networks owing to the size of the state-space, we propose a method for an approximate solution, which is shown to be highly accurate in two small examples.
منابع مشابه
Analytical evaluation of blocking probability in a mobile radio system with directed retry
In this paper, the blocking probability in a cellular network implementing directed retry (DR) is analyzed as a function of the main characteristics of the scenario (the density of base stations), the propagation model (path loss and shadowing), and the speed of mobiles. The analytical approach allows the evaluation of the blocking probability as a function of the maximum number of cells that c...
متن کاملA Simple IP Flow Blocking Model
Flow based networking can assist in addressing current performance issues in convergent IP networks and enable dynamic, real-time routing. The Scheme for Advanced Overflow Routing (SAPOR) is a method that enables flow based routing in IP networks. This paper presents an analytical model that allows the calculation of overflow probabilities for flows, transmitted via a bottleneck connection. The...
متن کاملImpact of Connection Admission Process on the Direct Retry Load Balancing Algorithm in Cellular Network
We present an analytical framework for modeling a priority-based load balancing scheme in cellular networks based on a new algorithm called direct retry with truncated offloading channel resource pool (DRK). The model differs in many respects from previous works on load balancing. Foremost, it incorporates the call admission process, through random access. In specific, the proposed model implem...
متن کاملA Distributed Load Balancing Algorithm for the Hot Cell Problem in Cellular Mobile Networks
We propose a novel distributed load balancing algorithm (D-LBSB) for the hot cell problem in cellular mobile networks. As an underlying approach, we start with a xed channel assignment scheme where each cell is initially allocated a set of C (local) channels, each to be assigned on demand to a user in the cell. A cell is classiied as`hot', if the degree of coldness of a cell (deened as the rati...
متن کاملA TESLA-based mutual authentication protocol for GSM networks
The widespread use of wireless cellular networks has made security an ever increasing concern. GSM is the most popular wireless cellular standard, but security is an issue. The most critical weakness in the GSM protocol is the use of one-way entity authentication, i.e., only the mobile station is authenticated by the network. This creates many security problems including vulnerability against m...
متن کامل